منابع مشابه
Duality for Borel Measurable Cost Functions
We consider the Monge-Kantorovich transport problem in an abstract measure theoretic setting. Our main result states that duality holds if c : X × Y → [0,∞) is an arbitrary Borel measurable cost function on the product of Polish spaces X,Y . In the course of the proof we show how to relate a non-optimal transport plan to the optimal transport costs via a “subsidy” function and how to identify t...
متن کاملStone Duality for Stable Functions
The problem of finding an algebraic structure for stable open subsets of a suitable domain has been recently raised by several authors. Specifically, it could be useful to have, in the stable case, a notion similar to the one of “frame”, in order to develop something similar to pointless topology, that is an algebraic insight of spaces. In domain theory, an interesting application of frame theo...
متن کاملDuality for the class of a multiobjective problem with support functions under $K$-$G_f$-invexity assumptions
In this article, we formulate two dual models Wolfe and Mond-Weir related to symmetric nondifferentiable multiobjective programming problems. Furthermore, weak, strong and converse duality results are established under $K$-$G_f$-invexity assumptions. Nontrivial examples have also been depicted to illustrate the theorems obtained in the paper. Results established in this paper unify...
متن کاملBenefit functions and duality
This paper studies a new representation of individ~l preferences termed the benefit function. The benetit function b(g; x,u) measures the amount that an individual is willing to trade, in terms of a specific reference commodity bundle g, for the opportunity to move from utility level a to a consumption bundle x. The benefit function is therefore a generalization of the willingness-to-pay concep...
متن کاملDuality and Auxiliary Functions for Bregman Distances
We formulate and prove a convex duality theorem for Bregman distances and present a technique based on auxiliary functions for deriving and proving convergence of iterative algorithms to minimize Bregman distance subject to linear constraints. This research was partially supported by the Advanced Research and Development Activity in Information Technology (ARDA), contract number MDA904-00-C-210...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Calculus of Variations and Partial Differential Equations
سال: 2011
ISSN: 0944-2669,1432-0835
DOI: 10.1007/s00526-011-0449-0